An approximation algorithm for multi-objective optimization problems using a box-coverage

Abstract For a continuous multi-objective optimization problem, it is usually not practical approach to compute all its nondominated points because there are infinitely many of them. this reason, typical an approximation the set. A common technique for generate polyhedron which contains However, often these approximations used further evaluations. those applications structure that easy handle. In paper, we introduce with simpler respecting natural ordering. particular, box-coverage To do so, use that, in general, allows us update only one but several boxes whenever new point found. The algorithm guaranteed stop finite number boxes, each being sufficiently thin.